From Connected Frequent Graphs to Unconnected Frequent Graphs
نویسنده
چکیده
We present the UFC (Unconnected From Connected) algorithm which discovers both connected and disconnected frequent graphs. It discovers connected frequent graphs by means of any existing graph mining algorithm and then joins these graphs with each other creating unconnected frequent graphs with increasing number of connected components. We compare our method with previously proposed UGM algorithm and a gSpan variation.
منابع مشابه
Mining for Unconnected Frequent Graphs with Direct Subgraph Isomorphism Tests
In the paper we propose the algorithm which discovers both connected and unconnected frequent graphs from the graphs set. Our approach is based on depth first search candidate generation and direct execution of subgraph isomorphism test over database. Several search space pruning techniques are also proposed. Due to lack of unconnected graph mining algorithms we compare our algorithm with two g...
متن کاملEfficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width
We study the frequent connected induced subgraph mining problem, i.e., the problem of listing all connected graphs that are induced subgraph isomorphic to a given number of transaction graphs. We first show that this problem cannot be solved for arbitrary transaction graphs in output polynomial time (if P 6= NP) and then prove that for graphs of bounded tree-width, frequent connected induced su...
متن کاملEfficient frequent connected subgraph mining in graphs of bounded tree-width
The frequent connected subgraph mining problem, i.e., the problem of listing all connected graphs that are subgraph isomorphic to at least a certain number of transaction graphs of a database, cannot be solved in output polynomial time in the general case. If, however, the transaction graphs are restricted to forests then the problem becomes tractable. In this paper we generalize the positive r...
متن کاملDagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multior single-rooted, and induced fragments. With a new canonical form that is based on the nodes' topological levels, our miner is faster and uses less storage than general purpose gSpan (Yan, X. and Han, J., 2002). Moreover, it can base support resp. frequency either on the number of embeddings o...
متن کاملGeneral Graph Refinement with Polynomial Delay
Of many graph mining algorithms an essential component is its procedure for enumerating graphs such that no two enumerated graphs are isomorphic. All frequent subgraph miners require such a component [14, 5, 1, 6], but also other data mining algorithms, such as for instance [7] require such a procedure, which is often called a “refinement operator” or a “join operator” depending on the enumerat...
متن کامل